In this paper, we study network coding capacity for random wireless networks.Previous work on network coding capacity for wired and wireless networks havefocused on the case where the capacities of links in the network areindependent. In this paper, we consider a more realistic model, where wirelessnetworks are modeled by random geometric graphs with interference and noise. Inthis model, the capacities of links are not independent. We consider twoscenarios, single source multiple destinations and multiple sources multipledestinations. In the first scenario, employing coupling and martingale methods,we show that the network coding capacity for random wireless networks stillexhibits a concentration behavior around the mean value of the minimum cutunder some mild conditions. Furthermore, we establish upper and lower bounds onthe network coding capacity for dependent and independent nodes. In the secondone, we also show that the network coding capacity still follows aconcentration behavior. Our simulation results confirm our theoreticalpredictions.
展开▼